Energy-efficiency virtual machine placement based on binary gravitational search algorithm
نویسندگان
چکیده
منابع مشابه
Discrete Gravitational Search Algorithm for Virtual Machine Placement in Cloud Computing
In Cloud Computing, VM placement is a critical issue which results in most beneficial levels including economical status. The task is to allocate the given VM to its best fit PM. Number of research oriented approaches are formulated for scheduling VM to appropriate PM. In this paper the author used Discrete Gravitational Search Algorithm for effective VM placement in the given host effectively....
متن کاملAvailability-Aware Energy-Efficient Virtual Machine Placement Algorithm
—Availability, as a part of Service Level Agreement (SLA), is a critically important issue in cloud services, which are affected by server or network failures in datacenters. Cloud service providers seek to not only fulfill the SLA, but also simultaneously minimize their operating costs, which are dominated by the energy consumption. In order to minimize the impact of a server/switch failure o...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cluster Computing
سال: 2019
ISSN: 1386-7857,1573-7543
DOI: 10.1007/s10586-019-03021-0